Minimal-Program Complexity of Sequences with Restricted Resources
نویسنده
چکیده
In this paper we investigate the minimal-program complexity of several types of pseudo-recursive and pseudo-random sequences when the resources used for their computation are restricted. For several types of these sequences their minimal-progra m complexity increases enormously whenever the resources for their computation is restricted in any effective manner at all. In particular, it is shown that Church random sequences must have very high minimal-program complexity when the computation resources are effectively restricted; whereas, it is known that when there are no restrictions on resources, there are Church random sequences with extremely low minimal-program complexity.
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملMolecular and Bioinformatics Analysis of Allelic Diversity in IGFBP2 Gene Promoter in Indigenous Makuee and Lori-Bakhtiari Sheep Breeds
The aim of this study was to perform molecular and bioinformatics analysis of IGFBP2 gene promoter in association with some economic traits in indigenous Makuee (MS) and Lori-Bakhtiari (LB) breeds. DNA was extracted from blood samples of 120 MS and 200 LB and a 297 bp fragment from the upstream sequences of studied gene was amplified and genotyped by single-strand conformational polymo...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملMeasurement of Complexity and Comprehension of a Program Through a Cognitive Approach
The inherent complexity of the software systems creates problems in the software engineering industry. Numerous techniques have been designed to comprehend the fundamental characteristics of software systems. To understand the software, it is necessary to know about the complexity level of the source code. Cognitive informatics perform an important role for better understanding the complexity o...
متن کاملDuality of $g$-Bessel sequences and some results about RIP $g$-frames
In this paper, first we develop the duality concept for $g$-Bessel sequences and Bessel fusion sequences in Hilbert spaces. We obtain some results about dual, pseudo-dual and approximate dual of frames and fusion frames. We also expand every $g$-Bessel sequence to a frame by summing some elements. We define the restricted isometry property for $g$-frames and generalize some resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Information and Control
دوره 23 شماره
صفحات -
تاریخ انتشار 1973